/*
 *https://leetcode.cn/problems/min-cost-climbing-stairs/description/
 *746. 使用最小花费爬楼梯
 *medium, 叶佳豪 2024.9.20
 *动态规划
 */

class Solution {
public:
    int minCostClimbingStairs(vector<int>& cost) {
        int n = cost.size();
        vector<int> dp(n + 1);
        dp[0] = dp[1] = 0;
        for (int i = 2; i <= n; i++) {
            dp[i] = min(dp[i - 1] + cost[i - 1], dp[i - 2] + cost[i - 2]);
        }
        return dp[n];
    }
};